Uniform approximation of differentiable functions by algebraic polynomials
نویسندگان
چکیده
منابع مشابه
Uniform and Pointwise Shape Preserving Approximation by Algebraic Polynomials
We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, “shape” refers to (finitely many changes of) monotonicity, convexity, or q-monotonicity of a function. It is rather well known that it is possible to approximate a function by algebraic polynomials that preserve its shape (i.e....
متن کاملUniform approximation of sgnx by polynomials and entire functions
In 1877, E. I. Zolotarev [19, 2] found an explicit expression, in terms of elliptic functions, of the rational function of given degree m which is uniformly closest to sgn (x) on the union of two intervals [−1,−a] ∪ [a, 1]. This result was subject to many generalizations, and it has applications in electric engineering. Surprisingly, to the best of our knowledge, the similar problem for polynom...
متن کاملUniform approximation by (quantum) polynomials
We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson’s Theorem, which gives a nearly-optimal quantitative version of Weierstrass’s Theorem on uniform approximation of continuous functions by polynomials. We provide two proofs, based respectively on quantum counting and on quantum phase estimation.
متن کاملNonlinear Approximation from Differentiable Piecewise Polynomials
We study nonlinear n-term approximation in Lp(R) (0 < p ≤ ∞) from hierarchical sequences of stable local bases consisting of differentiable (i.e., Cr with r ≥ 1) piecewise polynomials (splines). We construct such sequences of bases over multilevel nested triangulations of R2, which allow arbitrarily sharp angles. To quantize nonlinear nterm spline approximation, we introduce and explore a colle...
متن کاملUniform approximation by discrete least squares polynomials
We study uniform approximation of differentiable or analytic functions of one or several variables on a compact set K by a sequence of discrete least squares polynomials. In particular, if K satisfies a Markov inequality and we use point evaluations on standard discretization grids with the number of points growing polynomially in the degree, these polynomials provide nearly optimal approximant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1981
ISSN: 0021-9045
DOI: 10.1016/0021-9045(81)90017-4